Revisiting Boustrophedon Coverage Path Planning as a Generalized Traveling Salesman Problem

نویسندگان

چکیده

In this paper, we present a path planner for low-altitude terrain coverage in known environments with unmanned rotary-wing micro aerial vehicles (MAVs). Airborne systems can assist humanitarian demining by surveying suspected hazardous areas (SHAs) cameras, ground-penetrating synthetic aperture radar (GPSAR), and metal detectors. Most available implementations MAVs do not consider obstacles thus cannot be deployed obstructed environments. We describe an open-source framework to perform planning polygon flight corridors obstacles. Our extends boustrophedon optimizing over different sweep combinations find the optimal path, considers during transition flights between cells. evaluate on 320 maps show that it is able solve realistic instances fast enough run field. The achieves 14% lower costs than conventional planner. validate real platform where sloped trees.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coverage Path Planning: The Boustrophedon Cellular Decomposition

Coverage path planning is the determination of a path that a robot must take in order to pass over each point in an environment. Applications include vacuuming, oor scrubbing, and inspection. We developed the boustrophedon cellular decomposition, which is an exact cellular decomposition approach, for the purposes of coverage. Each cell in the boustrophedon is covered with simple back and forth ...

متن کامل

Informative path planning as a maximum traveling salesman problem with submodular rewards

In this paper we extend the classic problem of finding the maximum weight Hamiltonian cycle in a graph to the case where the objective is a submodular function of the edges. We consider a greedy algorithm and a 2-matching based algorithm, and we show that they have approximation factors of 1 2+κ and max{ 2 3(2+κ) , 2 3(1− κ)} respectively, where κ is the curvature of the submodular function. Bo...

متن کامل

Generalized Traveling Salesman Problem Reduction Algorithms

The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are required to find a minimum length tour that includes exactly one city from each group. The aim of this paper is to present a problem reduction algorithm that deletes redundant vertices and edges, preserving the value o...

متن کامل

Traveling salesman path problems

In the traveling salesman path problem, we are given a set of cities, traveling costs between city pairs and fixed source and destination cities. The objective is to find a minimum cost path from the source to destination visiting all cities exactly once. In this paper, we study polyhedral and combinatorial properties of a variant we call the traveling salesman walk problem, in which the object...

متن کامل

An Approach for Solving Traveling Salesman Problem

In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Springer proceedings in advanced robotics

سال: 2021

ISSN: ['2511-1256', '2511-1264']

DOI: https://doi.org/10.1007/978-981-15-9460-1_20